Mutual visibility by fat robots with slim omnidirectional camera

نویسندگان

چکیده

In the existing literature of Mutual Visibility problem for autonomous robot swarms, adopted visibility models have some idealistic assumptions that are not consistent with practical sensing device implementations. This paper investigates in more realistic model called opaque fat robots slim omnidirectional camera. The modeled as unit disks, each having an camera represented a disk smaller size. region obstructed by single this is truncated infinite cone. makes significantly challenging compared to previous ones. We assume compasses allow agreement direction and orientation both axes their local coordinate systems. equipped visible lights which serve medium communication also form memory. present distributed algorithm provably correct semi-synchronous setting. Our provides solution Leader Election we use subroutine our main algorithm. Although trivial two axis full model, it case independent interest.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mutual Visibility by Robots with Persistent Memory

This paper addresses the mutual visibility problem for a set of semi-synchronous, opaque robots occupying distinct positions in the Euclidean plane. Since robots are opaque, if three robots lie on a line, the middle robot obstructs the visions of the two other robots. The mutual visibility problem asks the robots to coordinate their movements to form a configuration, within finite time and with...

متن کامل

Mutual Visibility by Luminous Robots Without Collisions

Consider a finite set of identical computational entities that can move freely in the Euclidean plane operating in Look-Compute-Move cycles. Let p(t) denote the location of entity p at time t; entity p can see entity q at time t if at that time no other entity lies on the line segment p(t)q(t). We consider the basic problem called Mutual Visibility: starting from arbitrary distinct locations, w...

متن کامل

Circle Formation by Asynchronous Fat Robots with Limited Visibility

This paper proposes a distributed algorithm for circle formation by multiple autonomous mobile robots with limited visibility. Each robot sees up to a fixed distance around it and moves to a new position. Eventually they form a circle of a given radius. The robots do not store past actions. The robots are anonymous and cannot be distinguished by their appearances. All robots agree upon a common...

متن کامل

The Mutual Visibility Problem for Oblivious Robots

Consider a finite set of identical entities, called robots, which can move freely in the Euclidean plane. Let p(t) denote the location of robot p at time t; a robot p can see robot q at time t if at that time no other robot lies in the line segment p(t)q(t). We consider the basic problem called Mutual Visibility: starting from arbitrary distinct locations, within finite time the robots must rea...

متن کامل

Exploiting Mutual Camera Visibility in Multi-camera Motion Estimation

This paper addresses the estimation of camera motion and 3D reconstruction from image sequences for multiple independently moving cameras. If multiple moving cameras record the same scene, a camera is often visible in another camera’s field of view. This poses a constraint on the position of the observed camera, which can be included into the conjoined optimization process. The paper contains t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Parallel and Distributed Computing

سال: 2023

ISSN: ['1096-0848', '0743-7315']

DOI: https://doi.org/10.1016/j.jpdc.2023.104716